Combining Epistemic Logic and Hennessy-Milner Logic
نویسندگان
چکیده
We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the current state and past history of the execution. This is in the spirit of dynamic epistemic logic but is a direct combination of Hennessy-Milner logic and epistemic logic. We give an axiomatization for the logic and prove a completeness theorem with respect to the class of models obtained by unfolding labelled transition systems.
منابع مشابه
Dynamic Epistemic Spatial Logic ∗
In this paper we combine features of dynamic-epistemic logics with the spatial logics in order to obtain a decidable, fully axiomatized logic for expressing information flow in distributed multi-agent systems. Thus, Dynamic Epistemic Spatial Logic is as an extension of Hennessy-Milner logic with spatial and epistemic operators.
متن کاملDecidable Extensions of Hennessy-Milner Logic
We propose a new class of logics for specifying and modelchecking properties of distributed systems Dynamic Epistemic Spatial Logics. They have been designed as extensions of Hennessy-Milner logic with spatial operators (inspired by Cardelli-Gordon-Caires spatial logic) and epistemic operators (inspired by dynamic-epistemic logics). Our logics focus on observers, agents placed in different loca...
متن کاملModel checking Dynamic Epistemic Spatial Logics ∗
We propose a new class of logics for specifying and model-checking properties of distributed systems Dynamic Epistemic Spatial Logics. They have been designed as extensions of Hennessy-Milner logic with spatial operators (inspired by Cardelli-Caires spatial logic) and epistemic operators (inspired by dynamic-epistemic logics). Our logics focus on observers, agents placed in different locations ...
متن کاملBisimulation and Hennessy-Milner Logic for Generalized Synchronization Trees
In this work, we develop a generalization of Hennessy-Milner Logic (HML) for Generalized Synchronization Trees (GSTs) that we call Generalized Hennessy Milner Logic (GHML). Importantly, this logic suggests a strong relationship between (weak) bisimulation for GSTs and ordinary bisimulation for Synchronization Trees (STs). We demonstrate that this relationship can be used to define the GST analo...
متن کاملStrict Lower Bounds for Model Checking BPA
We show strict lower bounds for the complexity of several model checking problems for BPA and branching-time logics. Model checking with Hennessy-Milner Logic PSPACE-hard, while model checking with the modal-calculus is EXPTIME-hard. By combining these results with already established upper bounds it follows that the model checking problems are PSPACE-complete and EXPTIME-complete, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012